Freeness of automaton groups vs boundary dynamics
نویسندگان
چکیده
منابع مشابه
Freeness of automata groups vs boundary dynamics
We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this result to the class of bireversible transducers and we show that the property of being not free is equivalent to have a finite Schreier graph in the boundary of the enriched dual pointed on some essentially...
متن کاملAutomaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton (semi)groups and their dynamics on the boundary. First, we show that it is undecidable to check whether the group generated by a given invertible automaton has a p...
متن کاملSome Solvable Automaton Groups
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1, m), for m 6= ±1. In addition, it is shown that, for any relatively prime integers m, n ≥ 2, the pair of Baumslag-Solitar groups BS...
متن کاملOn the Freeness of Anticyclotomic Selmer Groups
We establish the freeness of certain anticyclotomic Selmer groups of modular forms. The freeness of these Selmer groups plays a key role in the Euler system arguments introduced in [BD05]. In particular, our result fills some implicit gaps in [PW11] and [CH15] which in turn allows the results of these papers to hold for modular forms whose residual representations are not minimally ramified. Re...
متن کاملAutomatic semigroups vs automaton semigroups
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2016
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.05.015